Leverrier's algorithm for orthogonal polynomial bases
نویسندگان
چکیده
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملIntegral Orthogonal Bases of Small Height for Real Polynomial Spaces
Let PN (R) be the space of all real polynomials in N variables with the usual inner product 〈 , 〉 on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form representing this inner product on the space of coefficient vectors of all polynomials in PN (R) of degree ≤ M . We exhibit two applications of this formula. First, given a...
متن کاملA Fast Algorithm for Orthogonal Polynomial Expansions on Sparse Grids∗
A fast algorithm is developed to compute orthogonal polynomial expansions on sparse grids for a function of d variables in a weighted L space. The proposed algorithm combines the fast cosine transform, a fast transform from the Chebyshev orthogonal polynomial basis to the orthogonal polynomial basis for the weighted L space and a fast algorithm of computing hierarchically structured basis funct...
متن کاملHilbert Bases for Orthogonal Arrays
In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretica...
متن کاملOrthogonal Bases for Polynomial Regres- Sion with Derivative Information in Uncer- Tainty Quantification
We discuss the choice of polynomial basis for approximation of uncertainty propagation through complex simulation models with capability to output derivative information. Our work is part of a larger research effort in uncertainty quantification using sampling methods augmented with derivative information. The approach has new challenges compared with standard polynomial regression. In particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00158-8